Covering Partial Cubes with Zones

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering Partial Cubes with Zones

A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of a hypercube in which the graph can be embedded. We consider the problem of covering the vertices of a partial cube with the minimum number of zones. The prob...

متن کامل

Partial-Sum Queries in OLAP Data Cubes Using Covering Codes

A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish a connection between the covering problem in the theory of error-correcting codes and the partial-sum problem and use this connection to devise algorithms for the partial-sum problem with efficient space-time trade-offs. For example, using our algorithms, with 44 percent additional storage, the ...

متن کامل

Packing and covering the complete graph with cubes

A decomposition of Kn \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum packing of Kn with G if L contains as few edges as possible. A decomposition of Kn U P, the complete graph union a graph P (called the padding), into edge disjoint copies of a graph G is called a minimum covering of Kn with G if P conta...

متن کامل

On even partial cubes

Fukuda and Handa [5] asked whether every even partial cube G is harmonic. It is shown that the answer is positive if the isometric dimension of G equals its diameter. This is in particular true if G has isometric dimension at most 6. Under an additional technical condition it is proved that an even G is harmonic or has two adjacent vertices whose diametrical vertices are at distance at least 4....

متن کامل

Tiled partial cubes

In the quest to better understand the connection between median graphs, triangle-free graphs and partial cubes, a hierarchy of subclasses of partial cubes has been introduced. In this article, we study the role of tiled partial cubes in this scheme. For instance, we prove that

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2015

ISSN: 1077-8926

DOI: 10.37236/5076